package stardust.product.ssq;

import java.util.Arrays;
import java.util.Random;

public class SSQ
{

  public static void main(String[] args)
  {
    Random rnd;
    int[] numbers = {3, 6, 10, 12, 14, 17, 24, 25, 31, 32, 33};
    int[] n = new int[6];
    int t;
    
    for (int i = 0; i < 40; i++)
    {
      rnd = new Random();
      
      j:
      for (int j = 0; j < 6; j++)
      {
        n[j] = rnd.nextInt(numbers.length);
        
        if (j == 0 && numbers[n[j]] >= 10 && rnd.nextBoolean())
        {
          j--;
          continue j;
        }
        else if (j == 5 && numbers[n[j]] <= 26 && rnd.nextBoolean())
        {
          j--;
          continue j;
        }
        
        k:
        for (int k = 0; k < j; k++)
        {
          if (n[j] == n[k])
          {
            j--;
            break k;
          }
        }
      }
      
      for (int j = 0; j < 6; j++)
      {
        n[j] = numbers[n[j]];
      }
      Arrays.sort(n);
      
      for (int j = 0; j < 6; j++)
      {
        System.out.print((n[j] < 10 ? "0" + n[j] : n[j]) + (j == 5 ? "" : ","));
      }
      
      t = rnd.nextInt(15) + 1;
      System.out.println(":" + (t < 10 ? "0" + t : t));
    }
  }
  
}
